Linearly Constrained Problems
نویسندگان
چکیده
The aim of this paper is to study the convergence properties of the gradient projection method and to apply these results to algorithms for linearly constrained problems. The main convergence result is obtained by defining a projected gradient, and proving that the gradient projection method forces the sequence of projected gradients to zero. A consequence of this result is that if the gradient projection method converges to a nondegenerate point of a linearly constrained problem, then the active and binding constraints are identified in a finite number of iterations. As an application of our theory, we develop quadratic programming algorithms that iteratively explore a subspace defined by the active constraints. These algorithms are able to drop and add many constraints from the active set, and can either compute an accurate minimizer by a direct method, or an approximate minimizer by an iterative method of the conjugate gradient type. Thus, these algorithms are attractive for large scale problems. We show that it is possible to develop a finite terminating quadratic programming algorithm without non-degeneracy assumptions.
منابع مشابه
A Novel Frequency Domain Linearly Constrained Minimum Variance Filter for Speech Enhancement
A reliable speech enhancement method is important for speech applications as a pre-processing step to improve their overall performance. In this paper, we propose a novel frequency domain method for single channel speech enhancement. Conventional frequency domain methods usually neglect the correlation between neighboring time-frequency components of the signals. In the proposed method, we take...
متن کاملA Derivative-free Method for Linearly Constrained Nonsmooth Optimization
This paper develops a new derivative-free method for solving linearly constrained nonsmooth optimization problems. The objective functions in these problems are, in general, non-regular locally Lipschitz continuous function. The computation of generalized subgradients of such functions is difficult task. In this paper we suggest an algorithm for the computation of subgradients of a broad class ...
متن کاملAlternating directions based contraction method for generally separable linearly constrained convex programming problems
The classical alternating direction method (ADM) has been well studied in the context of linearly constrained convex programming problems and variational inequalities where both the involved operators and constraints are separable into two parts. In particular, recentness has witnessed a number of novel applications arising in diversified areas (e.g. Image Processing and Statistics), for which ...
متن کاملLinearly Constrained Lq and Lqg Optimal Control
It has recently been shown that the logarithmic barrier method for solving nite-dimensional, linearly constrained quadratic optimization problems can be extended to an innnite-dimensional setting with complexity estimates similar to the nite dimensional case. As a consequence, an eecient computational method for solving the linearly constrained LQ control problem is now a vailable. In this pape...
متن کاملSeparation Theorem for Linearly Constrained
We solve the linearly constrained linear-quadratic LQ and linear-quadratic-Gaussian LQG optimal control problems. Closed form expressions of the optimal controls are derived, and the Separation Theorem is generalized.
متن کاملFourier-based state parameterization for optimal trajectory design of linearly constrained linear-quadratic systems
This technical report considers the design of optimal trajectories of linearly constrained linear quadratic (LQ) systems. It is shown that by applying a Fourier-based state parameterization approach a linearly constrained LQ problem can be converted into a quadratic programming problem. Simulation results show that the proposed approach is an accurate and computationally efficient design tool f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986